Abelian Properties of Words
نویسندگان
چکیده
We say that two finite words u and v are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an old question of G. Rauzy by exhibiting a class of words whose abelian complexity is everywhere equal to 3. We also investigate abelian repetitions in words and show that any infinite word with bounded abelian complexity contains abelian k-powers for every positive integer k.
منابع مشابه
Some Properties of Abelian Return Words
We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...
متن کاملDecision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a finite-state function of the Fibonacci representation of n. In this paper, we show how enumeration questions (such as counting the number of squares of length n in the Fibonacci word) can be decided purely mechanically, using a decision procedure. We reprove some kno...
متن کاملAvoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden’s theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word ...
متن کاملThe non-abelian tensor product of normal crossed submodules of groups
In this article, the notions of non-abelian tensor and exterior products of two normal crossed submodules of a given crossed module of groups are introduced and some of their basic properties are established. In particular, we investigate some common properties between normal crossed modules and their tensor products, and present some bounds on the nilpotency class and solvability length of the...
متن کاملk-Abelian Equivalence and Rationality
Two words u and v are said to be k-abelian equivalent if, for each word x of length at most k, the number of occurrences of x as a factor of u is the same as for v. We study some combinatorial properties of k-abelian equivalence classes. Our starting point is a characterization of k-abelian equivalence by rewriting, so-called k-switching. We show that the set of lexicographically least represen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009